MozartV1, PascalFrancis, Corpus, bibRecord, 000245

A lightweight reliable object migration protocol

Identifieur interne : 000245 ( PascalFrancis/Corpus ); précédent : 000244; suivant : 000246

A lightweight reliable object migration protocol

Auteurs : P. Van Roy ; P. Brand ; S. Haridi ; R. Collet

Source :

Lecture notes in computer science [ 0302-9743 ] ; 1999.

RBID : Pascal:00-0002465

Descripteurs français

Pascal (Inist)
- Langage programmation, Algorithme réparti, Tolérance faute, Analyse sémantique, Internet.

English descriptors

KwdEn :
- Distributed algorithm, Fault tolerance, Internet, Programming language, Semantic analysis.

Abstract

This paper presents a lightweight reliable object migration protocol that preserves the centralized object semantics, allows for precise prediction of network behavior, and permits construction of fault tolerance abstractions in the language. Each object has a "home site" to which all migration requests are directed. Compared to the standard technique of creating and collapsing forwarding chains, this gives a better worst-case network behavior and it limits dependencies on third-party sites. The protocol defines "freely mobile" objects that have the interesting property of always executing locally, i.e., each method executes in the thread that invokes it. This makes them dual, in a precise sense, to stationary objects. The protocol is designed to be as efficient as a nonreliable protocol in the common case of no failure, and to provide sufficient hooks so that common fault tolerance algorithms can be programmed completely in the Oz language. The protocol is fully implemented in the network layer of the Mozart platform for distributed application development, which implements Oz (see http://www.mozart-oz.org). This paper defines the protocol in an intuitive yet precise way using the concept of distribution graph to model distributed execution of language entities. Formalization and proof of protocol properties are done elsewhere.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1686`
A08	`01`	`1`	`ENG`	`@1 A lightweight reliable object migration protocol`
A09	`01`	`1`	`ENG`	`@1 Internet programming languages : Chicago IL, 13 May 1998`
A11	`01`	`1`		`@1 VAN ROY (P.)`
A11	`02`	`1`		`@1 BRAND (P.)`
A11	`03`	`1`		`@1 HARIDI (S.)`
A11	`04`	`1`		`@1 COLLET (R.)`
A12	`01`	`1`		`@1 BAL (Henri E.) @9 ed.`
A12	`02`	`1`		`@1 BELKHOUCHE (Boumediene) @9 ed.`
A12	`03`	`1`		`@1 CARDELLI (Luca) @9 ed.`
A14	`01`			`@1 Université catholique de Louvain @2 1348 Louvain-la-Neuve @3 BEL @Z 1 aut. @Z 4 aut.`
A14	`02`			`@1 Swedish Institute of Computer Science @2 164 28 Kista @3 SWE @Z 1 aut. @Z 2 aut. @Z 3 aut.`
A20				`@1 32-46`
A21				`@1 1999`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-66673-7`
A43	`01`			`@1 INIST @2 16343 @5 354000080037910020`
A44				`@0 0000 @1 © 2000 INIST-CNRS. All rights reserved.`
A45				`@0 19 ref.`
A47	`01`	`1`		`@0 00-0002465`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	@0 This paper presents a lightweight reliable object migration protocol that preserves the centralized object semantics, allows for precise prediction of network behavior, and permits construction of fault tolerance abstractions in the language. Each object has a "home site" to which all migration requests are directed. Compared to the standard technique of creating and collapsing forwarding chains, this gives a better worst-case network behavior and it limits dependencies on third-party sites. The protocol defines "freely mobile" objects that have the interesting property of always executing locally, i.e., each method executes in the thread that invokes it. This makes them dual, in a precise sense, to stationary objects. The protocol is designed to be as efficient as a nonreliable protocol in the common case of no failure, and to provide sufficient hooks so that common fault tolerance algorithms can be programmed completely in the Oz language. The protocol is fully implemented in the network layer of the Mozart platform for distributed application development, which implements Oz (see http://www.mozart-oz.org). This paper defines the protocol in an intuitive yet precise way using the concept of distribution graph to model distributed execution of language entities. Formalization and proof of protocol properties are done elsewhere.
C02	`01`	`X`		`@0 001D02B02`
C03	`01`	`X`	`FRE`	`@0 Langage programmation @5 01`
C03	`01`	`X`	`ENG`	`@0 Programming language @5 01`
C03	`01`	`X`	`SPA`	`@0 Lenguaje programación @5 01`
C03	`02`	`X`	`FRE`	`@0 Algorithme réparti @5 02`
C03	`02`	`X`	`ENG`	`@0 Distributed algorithm @5 02`
C03	`02`	`X`	`SPA`	`@0 Algoritmo repartido @5 02`
C03	`03`	`X`	`FRE`	`@0 Tolérance faute @5 03`
C03	`03`	`X`	`ENG`	`@0 Fault tolerance @5 03`
C03	`03`	`X`	`SPA`	`@0 Tolerancia falta @5 03`
C03	`04`	`X`	`FRE`	`@0 Analyse sémantique @5 04`
C03	`04`	`X`	`ENG`	`@0 Semantic analysis @5 04`
C03	`04`	`X`	`SPA`	`@0 Análisis semántico @5 04`
C03	`05`	`X`	`FRE`	`@0 Internet @5 05`
C03	`05`	`X`	`ENG`	`@0 Internet @5 05`
C03	`05`	`X`	`SPA`	`@0 Internet @5 05`
N21				`@1 003`

A30	`01`	`1`	`ENG`	`@1 ICCL'98 workshop @3 Chicago IL USA @4 1998-05-13`

Format Inist (serveur)

NO :	PASCAL 00-0002465 INIST
ET :	A lightweight reliable object migration protocol
AU :	VAN ROY (P.); BRAND (P.); HARIDI (S.); COLLET (R.); BAL (Henri E.); BELKHOUCHE (Boumediene); CARDELLI (Luca)
AF :	Université catholique de Louvain/1348 Louvain-la-Neuve/Belgique (1 aut., 4 aut.); Swedish Institute of Computer Science/164 28 Kista/Suède (1 aut., 2 aut., 3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1686; Pp. 32-46; Bibl. 19 ref.
LA :	Anglais
EA :	This paper presents a lightweight reliable object migration protocol that preserves the centralized object semantics, allows for precise prediction of network behavior, and permits construction of fault tolerance abstractions in the language. Each object has a "home site" to which all migration requests are directed. Compared to the standard technique of creating and collapsing forwarding chains, this gives a better worst-case network behavior and it limits dependencies on third-party sites. The protocol defines "freely mobile" objects that have the interesting property of always executing locally, i.e., each method executes in the thread that invokes it. This makes them dual, in a precise sense, to stationary objects. The protocol is designed to be as efficient as a nonreliable protocol in the common case of no failure, and to provide sufficient hooks so that common fault tolerance algorithms can be programmed completely in the Oz language. The protocol is fully implemented in the network layer of the Mozart platform for distributed application development, which implements Oz (see http://www.mozart-oz.org). This paper defines the protocol in an intuitive yet precise way using the concept of distribution graph to model distributed execution of language entities. Formalization and proof of protocol properties are done elsewhere.
CC :	001D02B02
FD :	Langage programmation; Algorithme réparti; Tolérance faute; Analyse sémantique; Internet
ED :	Programming language; Distributed algorithm; Fault tolerance; Semantic analysis; Internet
SD :	Lenguaje programación; Algoritmo repartido; Tolerancia falta; Análisis semántico; Internet
LO :	INIST-16343.354000080037910020
ID :	00-0002465

Links to Exploration step

Pascal:00-0002465

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A lightweight reliable object migration protocol</title>
<author><name sortKey="Van Roy, P" sort="Van Roy, P" uniqKey="Van Roy P" first="P." last="Van Roy">P. Van Roy</name>
<affiliation><inist:fA14 i1="01"><s1>Université catholique de Louvain</s1>
<s2>1348 Louvain-la-Neuve</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>Swedish Institute of Computer Science</s1>
<s2>164 28 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Brand, P" sort="Brand, P" uniqKey="Brand P" first="P." last="Brand">P. Brand</name>
<affiliation><inist:fA14 i1="02"><s1>Swedish Institute of Computer Science</s1>
<s2>164 28 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Haridi, S" sort="Haridi, S" uniqKey="Haridi S" first="S." last="Haridi">S. Haridi</name>
<affiliation><inist:fA14 i1="02"><s1>Swedish Institute of Computer Science</s1>
<s2>164 28 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Collet, R" sort="Collet, R" uniqKey="Collet R" first="R." last="Collet">R. Collet</name>
<affiliation><inist:fA14 i1="01"><s1>Université catholique de Louvain</s1>
<s2>1348 Louvain-la-Neuve</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0002465</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 00-0002465 INIST</idno>
<idno type="RBID">Pascal:00-0002465</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000245</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A lightweight reliable object migration protocol</title>
<author><name sortKey="Van Roy, P" sort="Van Roy, P" uniqKey="Van Roy P" first="P." last="Van Roy">P. Van Roy</name>
<affiliation><inist:fA14 i1="01"><s1>Université catholique de Louvain</s1>
<s2>1348 Louvain-la-Neuve</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation><inist:fA14 i1="02"><s1>Swedish Institute of Computer Science</s1>
<s2>164 28 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Brand, P" sort="Brand, P" uniqKey="Brand P" first="P." last="Brand">P. Brand</name>
<affiliation><inist:fA14 i1="02"><s1>Swedish Institute of Computer Science</s1>
<s2>164 28 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Haridi, S" sort="Haridi, S" uniqKey="Haridi S" first="S." last="Haridi">S. Haridi</name>
<affiliation><inist:fA14 i1="02"><s1>Swedish Institute of Computer Science</s1>
<s2>164 28 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Collet, R" sort="Collet, R" uniqKey="Collet R" first="R." last="Collet">R. Collet</name>
<affiliation><inist:fA14 i1="01"><s1>Université catholique de Louvain</s1>
<s2>1348 Louvain-la-Neuve</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1999">1999</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Distributed algorithm</term>
<term>Fault tolerance</term>
<term>Internet</term>
<term>Programming language</term>
<term>Semantic analysis</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Langage programmation</term>
<term>Algorithme réparti</term>
<term>Tolérance faute</term>
<term>Analyse sémantique</term>
<term>Internet</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper presents a lightweight reliable object migration protocol that preserves the centralized object semantics, allows for precise prediction of network behavior, and permits construction of fault tolerance abstractions in the language. Each object has a "home site" to which all migration requests are directed. Compared to the standard technique of creating and collapsing forwarding chains, this gives a better worst-case network behavior and it limits dependencies on third-party sites. The protocol defines "freely mobile" objects that have the interesting property of always executing locally, i.e., each method executes in the thread that invokes it. This makes them dual, in a precise sense, to stationary objects. The protocol is designed to be as efficient as a nonreliable protocol in the common case of no failure, and to provide sufficient hooks so that common fault tolerance algorithms can be programmed completely in the Oz language. The protocol is fully implemented in the network layer of the Mozart platform for distributed application development, which implements Oz (see http://www.mozart-oz.org). This paper defines the protocol in an intuitive yet precise way using the concept of distribution graph to model distributed execution of language entities. Formalization and proof of protocol properties are done elsewhere.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1686</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>A lightweight reliable object migration protocol</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Internet programming languages : Chicago IL, 13 May 1998</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>VAN ROY (P.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>BRAND (P.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>HARIDI (S.)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>COLLET (R.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BAL (Henri E.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>BELKHOUCHE (Boumediene)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>CARDELLI (Luca)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Université catholique de Louvain</s1>
<s2>1348 Louvain-la-Neuve</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Swedish Institute of Computer Science</s1>
<s2>164 28 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>32-46</s1>
</fA20>
<fA21><s1>1999</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-66673-7</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000080037910020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>19 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>00-0002465</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>This paper presents a lightweight reliable object migration protocol that preserves the centralized object semantics, allows for precise prediction of network behavior, and permits construction of fault tolerance abstractions in the language. Each object has a "home site" to which all migration requests are directed. Compared to the standard technique of creating and collapsing forwarding chains, this gives a better worst-case network behavior and it limits dependencies on third-party sites. The protocol defines "freely mobile" objects that have the interesting property of always executing locally, i.e., each method executes in the thread that invokes it. This makes them dual, in a precise sense, to stationary objects. The protocol is designed to be as efficient as a nonreliable protocol in the common case of no failure, and to provide sufficient hooks so that common fault tolerance algorithms can be programmed completely in the Oz language. The protocol is fully implemented in the network layer of the Mozart platform for distributed application development, which implements Oz (see http://www.mozart-oz.org). This paper defines the protocol in an intuitive yet precise way using the concept of distribution graph to model distributed execution of language entities. Formalization and proof of protocol properties are done elsewhere.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Langage programmation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Programming language</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Lenguaje programación</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Algorithme réparti</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Distributed algorithm</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Algoritmo repartido</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Tolérance faute</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Fault tolerance</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Tolerancia falta</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Analyse sémantique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Semantic analysis</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Análisis semántico</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Internet</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Internet</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Internet</s0>
<s5>05</s5>
</fC03>
<fN21><s1>003</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>ICCL'98 workshop</s1>
<s3>Chicago IL USA</s3>
<s4>1998-05-13</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 00-0002465 INIST</NO>
<ET>A lightweight reliable object migration protocol</ET>
<AU>VAN ROY (P.); BRAND (P.); HARIDI (S.); COLLET (R.); BAL (Henri E.); BELKHOUCHE (Boumediene); CARDELLI (Luca)</AU>
<AF>Université catholique de Louvain/1348 Louvain-la-Neuve/Belgique (1 aut., 4 aut.); Swedish Institute of Computer Science/164 28 Kista/Suède (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1686; Pp. 32-46; Bibl. 19 ref.</SO>
<LA>Anglais</LA>
<EA>This paper presents a lightweight reliable object migration protocol that preserves the centralized object semantics, allows for precise prediction of network behavior, and permits construction of fault tolerance abstractions in the language. Each object has a "home site" to which all migration requests are directed. Compared to the standard technique of creating and collapsing forwarding chains, this gives a better worst-case network behavior and it limits dependencies on third-party sites. The protocol defines "freely mobile" objects that have the interesting property of always executing locally, i.e., each method executes in the thread that invokes it. This makes them dual, in a precise sense, to stationary objects. The protocol is designed to be as efficient as a nonreliable protocol in the common case of no failure, and to provide sufficient hooks so that common fault tolerance algorithms can be programmed completely in the Oz language. The protocol is fully implemented in the network layer of the Mozart platform for distributed application development, which implements Oz (see http://www.mozart-oz.org). This paper defines the protocol in an intuitive yet precise way using the concept of distribution graph to model distributed execution of language entities. Formalization and proof of protocol properties are done elsewhere.</EA>
<CC>001D02B02</CC>
<FD>Langage programmation; Algorithme réparti; Tolérance faute; Analyse sémantique; Internet</FD>
<ED>Programming language; Distributed algorithm; Fault tolerance; Semantic analysis; Internet</ED>
<SD>Lenguaje programación; Algoritmo repartido; Tolerancia falta; Análisis semántico; Internet</SD>
<LO>INIST-16343.354000080037910020</LO>
<ID>00-0002465</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000245 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000245 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:00-0002465
   |texte=   A lightweight reliable object migration protocol
}}

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023

	Serveur d'exploration sur Mozart
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur Mozart

A lightweight reliable object migration protocol

A lightweight reliable object migration protocol

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri